Structural Discrimination of Networks by Using Distance, Degree and Eigenvalue-Based Measures
نویسندگان
چکیده
منابع مشابه
Structural Discrimination of Networks by Using Distance, Degree and Eigenvalue-Based Measures
In chemistry and computational biology, structural graph descriptors have been proven essential for characterizing the structure of chemical and biological networks. It has also been demonstrated that they are useful to derive empirical models for structure-oriented drug design. However, from a more general (complex network-oriented) point of view, investigating mathematical properties of struc...
متن کاملan investigation into translation of cultural concepts by beginner and advance student using think – aloud protocols
this research aims at answering the questions about translation problems and strategies applied by translators when translating cultural concepts. in order to address this issue, qualitative and quantitative study were conducted on two groups of subjects at imam reza international university of mashhad. these two groups were assigned as beginner and advanced translation students (10 students). ...
Structure-based graph distance measures of high degree of precision
Department of Computing and Information Technology, Fudan University, Shanghai, China 2 Theoretical Systems Biology Lab , School of Life Science, Fudan University, Shanghai, China Human Genetics Center, University of Texas Health Science Center at Houston, Houston, TX 77225, USA Abstract In recent years, evaluating graph distance has become more and more important in a variety of real applicati...
متن کاملAcoustic discrimination among words based on distance measures
In the development of a large-dictionary real-time speech recognition system, an approach commonly accepted is based on a multi-stage design (ref 1). In the first stages, starting from the acoustic data produced by uttering an item (syllable, word, sentence), a fast selection of a small subset of the vocabulary is performed. In the last stage, a detailed search of the most likely item is conduc...
متن کاملDegree distance index of the Mycielskian and its complement
In this paper, we determine the degree distance of the complement of arbitrary Mycielskian graphs. It is well known that almost all graphs have diameter two. We determine this graphical invariant for the Mycielskian of graphs with diameter two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS ONE
سال: 2012
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0038564